| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | plutao.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | J8LNKAN8RW/37NR2P2 |
| Repository | dpi.inpe.br/plutao@80/2010/06.25.16.12 (restricted access) |
| Last Update | 2010:08.12.17.18.46 (UTC) administrator |
| Metadata Repository | dpi.inpe.br/plutao@80/2010/06.25.16.12.25 |
| Metadata Last Update | 2018:06.05.00.13.06 (UTC) administrator |
| Secondary Key | INPE--PRE/ |
| DOI | 10.1016/j.parco.2009.09.005 |
| ISSN | 0167-8191 |
| Label | lattes: 6187221670775160 3 SanchesSomaYana:2010:ObOpPa |
| Citation Key | SanchesSomaYana:2010:ObOpPa |
| Title | Observations on optimal parallelizations of two-list algorithm  |
| Year | 2010 |
| Month | Jan. |
| Access Date | 2024, May 19 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 129 KiB |
| 2. Context | |
| Author | 1 Sanches, Carlos Alberto Alonso 2 Soma, Nei Yoshihiro 3 Yanasse, Horacio Hideki |
| Resume Identifier | 1 2 3 8JMKD3MGP5W/3C9JHCP |
| Group | 1 2 3 LAC-CTE-INPE-MCT-BR |
| Affiliation | 1 CTA ITA IEC, Inst Tecnol Aeronaut, BR-12228900 Sao Jose Dos Campos, SP Brazil 2 CTA ITA IEC, Inst Tecnol Aeronaut, BR-12228900 Sao Jose Dos Campos, SP Brazil 3 Instituto Nacional de Pesquisas Espaciais (INPE) |
| Author e-Mail Address | 1 horacio@lac.inpe.br |
| e-Mail Address | horacio@lac.inpe.br |
| Journal | Parallel Computing |
| Volume | 36 |
| Number | 1 |
| Pages | 65-67 |
| Secondary Mark | B1_CIÊNCIA_DA_COMPUTAÇÃO A2_ENGENHARIAS_III B1_ENGENHARIAS_IV |
| History (UTC) | 2010-06-29 12:04:21 :: lattes -> marciana :: 2010 2010-08-12 17:18:46 :: marciana -> administrator :: 2010 2018-06-05 00:13:06 :: administrator -> marciana :: 2010 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Abstract | For more than three decades, the very well known and famous two-list Horowitz and Sahni algorithm [3] remains the serial upper-bound for the 01 Knapsack problem with n items (KP01) in a time bounded by View the MathML source. Recently, Chedid [2] suggested an optimal parallelization for that algorithm to a KP01 variation the subset-sum problem in a PRAM CREW with p=2n/8 processors. It is presented here that, in addition to be incomplete, the Chedid result is a particular case given by Sanches et a. |
| Area | COMP |
| Arrangement | urlib.net > Produção anterior à 2021 > LABAC > Observations on optimal... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| Language | en |
| Target File | sanches.pdf |
| User Group | administrator lattes marciana |
| Visibility | shown |
| Archiving Policy | denypublisher denyfinaldraft24 |
| Read Permission | deny from all and allow from 150.163 |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
| Dissemination | WEBSCI; PORTALCAPES. |
| Host Collection | dpi.inpe.br/plutao@80/2008/08.19.15.01 |
| 6. Notes | |
| Empty Fields | alternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel documentstage format isbn keywords lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |